WORST_CASE(?,O(n^2))

Solution:
---------

  "c" :: ["A"(7, 7)] -(7)-> "A"(0, 7)
  "c" :: ["A"(0, 0)] -(0)-> "A"(2, 0)
  "f" :: ["A"(2, 0) x "A"(0, 7)] -(1)-> "A"(3, 2)
  "s" :: ["A"(2, 0)] -(2)-> "A"(2, 0)
  "s" :: ["A"(0, 0)] -(0)-> "A"(0, 7)


Cost Free Signatures:
---------------------

  "c" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "c" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(4, 0)
  "f" :: ["A"_cf(0, 0) x "A"_cf(0, 0)] -(0)-> "A"_cf(10, 10)
  "f" :: ["A"_cf(0, 0) x "A"_cf(0, 0)] -(0)-> "A"_cf(5, 6)
  "s" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "s" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 8)
  "s" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 1)


Base Constructors:
------------------
  "\"c\"_A" :: ["A"(0, 0)] -(0)-> "A"(1, 0)
  "\"c\"_A" :: ["A"(1, 1)] -(1)-> "A"(0, 1)
  "\"s\"_A" :: ["A"(1, 0)] -(1)-> "A"(1, 0)
  "\"s\"_A" :: ["A"(0, 0)] -(0)-> "A"(0, 1)